Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality

نویسندگان

  • Omar AitMous
  • Frédérique Bassino
  • Cyril Nicaud
چکیده

We present an algorithm for constructing the minimal automaton recognizing AX, where the pattern X is a set of m (that is a fixed integer) non-empty words over a finite alphabet A whose sum of lengths is n. This algorithm, inspired by Brzozowski’s minimization algorithm, uses sparse lists to achieve a linear time complexity with respect to n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ASSOCIATED PRIME IDEALS IN C(X)

The minimal prime decomposition for semiprime ideals is defined and studied on z-ideals of C(X). The necessary and sufficient condition for existence of the minimal prime decomposition of a z-ideal / is given, when / satisfies one of the following conditions: (i) / is an intersection of maximal ideals. (ii) I is an intersection of O , s, when X is basically disconnected. (iii) I=O , when x X h...

متن کامل

A Certain Class of Character Module Homomorphisms on Normed Algebras

For two normed algebras $A$ and $B$ with the character space   $bigtriangleup(B)neq emptyset$  and a left $B-$module $X,$  a certain class of bounded linear maps from $A$ into $X$ is introduced. We set $CMH_B(A, X)$  as the set of all non-zero $B-$character module homomorphisms from $A$ into $X$. In the case where $bigtriangleup(B)=lbrace varphirbrace$ then $CMH_B(A, X)bigcup lbrace 0rbrace$ is...

متن کامل

Functionally closed sets and functionally convex sets in real Banach spaces

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

متن کامل

Bilateral composition operators on vector-valued Hardy spaces

Let $T$ be a bounded operator on the Banach space $X$ and $ph$ be an analytic self-map of the unit disk $Bbb{D}$‎. ‎We investigate some operator theoretic properties of‎ ‎bilateral composition operator $C_{ph‎, ‎T}‎: ‎f ri T circ f circ ph$ on the vector-valued Hardy space $H^p(X)$ for $1 leq p leq‎ ‎+infty$.‎ ‎Compactness and weak compactness of $C_{ph‎, ‎T}$ on $H^p(X)$‎ ‎are characterized an...

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010